Voronoi diagram with visual restriction
نویسندگان
چکیده
منابع مشابه
Saliency Detection with VORONOI Diagram
Many applications are serviced by the Voronoi tessellation required to split image into Voronoi regions. An automatic method to learn and detect salient region for color image with support of the Voronoi diagram is presented. Salient regions are modeled as flexible circumstance corresponding to centers of mass. The centers are predicted by local contrast-based representation with local maxima. ...
متن کاملTime - Based Voronoi Diagram ∗
We consider a variation of Voronoi diagram, or time-based Voronoi diagram, for a set S of points in the presence of transportation lines or highways in the plane. A shortest time-distance path from a query point to any given point in S is a path that takes the least travelling time. The travelling speeds and hence travelling times of the subpaths along the highways and in the plane are differen...
متن کاملRounding Voronoi Diagram
Computational geometry classically assumes real-number arithmetic which does not exist in actual computers. A solution consists in using integer coordinates for data and exact arithmetic for computations. This approach implies that if the results of an algorithm are the input of another, these results must be rounded to match this hypothesis of integer coordinates. In this paper, we treat the c...
متن کاملVectorization with the Voronoi L-diagram
A new precision vectorization method has been developed for building centerlines of plain shapes. First a dense skeleton is computed. Centerlines are obtained as a subset of branches of the dense skeleton. The dense skeleton can also be used for obtaining medial axes of shapes. To obtain high precision, the distance transformation 12-17-38 was developed, which gives a good approximation of the ...
متن کاملANN queries: covering Voronoi diagram with hyperboxes
Given a set S of n points in d-dimensional Euclidean metric space X and a small positive real number ǫ, we present an algorithm to preprocess S and answer queries that require finding a set S′ ⊆ S of ǫ-approximate nearest neighbors (ANNs) to a given query point q ∈ X . The following are the characteristics of points belonging to set S′: ∀s ∈ S′, ∃ a point p ∈ X such that |pq| ≤ ǫ and the neares...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.08.008